Is There a Curse of Dimensionality for Contraction
نویسندگان
چکیده
This paper analyzes the complexity of the contraction fixed point problem: compute an ε-approximation to the fixed point V ∗ = Γ(V ∗) of a contraction mapping Γ that maps a Banach space Bd of continuous functions of d variables into itself. We focus on quasi linear contractions where Γ is a nonlinear functional of a finite number of conditional expectation operators. This class includes contractive Fredholm integral equations that arise in asset pricing applications and the contractive Bellman equation from dynamic programming. In the absence of further restrictions on the domain of Γ, the quasi linear fixed point problem is subject to the curse of dimensionality, i.e., in the worst case the minimal number of function evaluations and arithmetic operations required to compute an ε-approximation to a fixed point V ∗ ∈ Bd increases exponentially in d. We show that the curse of dimensionality disappears if the domain of Γ has additional special structure. We identify a particular type of special structure for which the problem is strongly tractable even in the worst case, i.e., the number of function evaluations and arithmetic operations needed to compute an ε-approximation of V ∗ is bounded by Cε−p where C and p are constants independent of d. We present examples of economic problems that have this type of special structure including a class of rational expectations asset pricing problems for which the optimal exponent p = 1 is nearly achieved. ∗This research was supported in part by the Alfred P. Sloan Foundation. J. F. Traub and H. Woźniakowski were supported in part by the NSF.
منابع مشابه
No Curse of Dimensionality for Contraction Fixed Points Even in the Worst Case
We consider the problem of computing approximations to xed points of quasilinear contraction mappings ? deened on the space of continuous functions of d variables. Our main emphasis is on large d. Examples of such mappings include the Bellman operator from the theory of dynamic programming. This paper proves that there exist deterministic algorithms for computing approximations to xed points fo...
متن کاملRemember the Curse of Dimensionality: The Case of Goodness-of-Fit Testing in Arbitrary Dimension
Despite a substantial literature on nonparametric two-sample goodness-of-fit testing in arbitrary dimensions, there is no mention there of any curse of dimensionality. In fact, in some publications, a parametric rate is derived. As we discuss below, this is because a directional alternative is considered. Indeed, even in dimension one, Ingster (1987) has shown that the minimax rate is not param...
متن کاملSub-pixel classification of hydrothermal alteration zones using a kernel-based method and hyperspectral data; A case study of Sarcheshmeh Porphyry Copper Mine and surrounding area, Kerman, Iran
Remote sensing image analysis can be carried out at the per-pixel (hard) and sub-pixel (soft) scales. The former refers to the purity of image pixels, while the latter refers to the mixed spectra resulting from all objects composing of the image pixels. The spectral unmixing methods have been developed to decompose mixed spectra. Data-driven unmixing algorithms utilize the reference data called...
متن کاملAcceleration Operators in the Value Iteration Algorithms for Markov Decision Processes
We propose a general approach to accelerate the convergence of the widely used solution methods of Markov decision processes. The approach is inspired by the monotone behavior of the contraction mappings in the feasible set of the linear programming problem equivalent to the MDP. Numerical studies show that the computational savings can be significant especially in the cases where the standard ...
متن کامل